Single Machine Scheduling with Nonmonotonic Piecewise Linear Time Dependent Processing Times
نویسندگان
چکیده
In this work, we introduce a single machine scheduling problem, in which the processing time of a job increases when its start time deviates from a given job dependent ideal time. This problem differs from similar problems found in literature by the fact that most time dependent problems only allow monotonic change in processing time. Its application lies in scheduling of a single worker who successively picks up components and takes them to a moving conveyor belt, for assembling them into a product. We solved the problem by developing a branch and bound procedure. Consider a conveyor line which moves a product with a constant speed along a straight line. The assembly consists of several independent jobs that need to be scheduled. We focus on a single worker only. In each of his or her jobs, he or she first picks up a component, then builds it into the product. Every part has its own fixed storage location along the conveyor line. Thus, the worker needs to walk from the product to the storage location and back. As this distance depends on the current product position, it is time dependent. Minimum distance occurs at the point in time when the product passes the storage location, to which we will refer as the ideal time. As the distance increases both before and after the ideal time, it is a nonlinear function of time. We assume a constant walking speed that is faster than the conveyor speed. Then, the walking time equals distance divided by speed. This walking time is added to the assembly time of a job, thus the processing time is nonlinearly time dependent. Scheduling with time dependent processing times has increasingly been studied in the last two decades. Often considered are learning or deterioration effects, sometimes both, e.g. Biskup (2008), Janiak, Krysiak & Trela (2011), as well as controllable processing times with influence on the cost (Shabtay & Steiner 2007). Monotonous functions of time, either increasing or decreasing, are most common (Gawiejnowicz 2008, p. 51), especially linear or piecewise linear cases (Alidaee & Womer 1999, Cheng, Ding & Lin 2004). What has been studied to a lesser extent are convex functions that are both decreasing and increasing over time. These could be used to model our application, because the walking time is minimum at the ideal time, and increases when deviating in both directions. One of the simplest objective functions in scheduling is to minimize the completion time of all jobs, namely Cmax. In our application, this leads to a maximization of the number of products assembled per time frame. Therefore, minimizing Cmax matches the application case.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل